Singular sources mining using evidential conflict analysis
نویسندگان
چکیده
Singular sources mining is essential in many applications like sensor fusion or dataset analysis. A singular source of information provides pieces of evidence that are significantly different from the majority of the other sources. In the Dempster-Shafer theory, the pieces of evidence collected by a source are summarized by basic belief assignments (bbas). In this article, we propose to mine singular sources by analysing the conflict between their corresponding bbas. By viewing the conflict as a function of parameters called discounting rates, new developments are obtained and a criterion that weights the contribution of each bba to the conflict is introduced. The efficiency and the robustness of this criterion is demonstrated on several sets of bbas with various specificities.
منابع مشابه
Mining Frequent Itemsets in Evidential Database
Mining frequent patterns is widely used to discover knowledge from a database. It was originally applied on Market Basket Analysis (MBA) problem which represents the Boolean databases. In those databases, only the existence of an article (item) in a transaction is defined. However, in real-world application, the gathered information generally suffer from imperfections. In fact, a piece of infor...
متن کاملSynthesizing Global Negative Association Rules in Multi-Database Mining
Association rule mining has been widely adopted by data mining community for discovering relationship among item-sets that co-occur together frequently. Besides positive association rules, negative association rule mining, which find out negation relationships of frequent item-sets are also important. The importance of negative association rule mining is accounted in customer-driven domains suc...
متن کاملA New Algorithm for Mining Frequent Itemsets from Evidential Databases
Association rule mining (ARM) problem has been extensively tackled in the context of perfect data. However, real applications showed that data are often imperfect (incomplete and/or uncertain) which leads to the need of ARM algorithms that process imperfect databases. In this paper we propose a new algorithm for mining frequent itemsets from evidential databases. We introduce a new structure ca...
متن کاملMining Association Rules with Uncertain Item Relationships
In order to enhance the precision in association rule mining, an extension is proposed to capture the uncertain item relationships in the data sets in this paper. Two sources of uncertainty are considered: the degree of individual item importance (multiplicity) and the degree of association among the items (inter-relationship). In many real-world applications, especially in a distributed enviro...
متن کاملMaking decisions in a complex information environment: evidential preference and information we trust
BACKGROUND Informed decision making requires that those individuals making health and health-care decisions understand the advantages and disadvantages associated with particular health options. Research and theory suggest factors that contribute to the decision-making process: data on the likelihood of risks and benefits, level of certainty about outcomes, familiarity with the health issue, ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 52 شماره
صفحات -
تاریخ انتشار 2011